Robust quantum compilation and circuit optimisation via energy minimisation
نویسندگان
چکیده
We explore a method for automatically recompiling quantum circuit A into target B, with the goal that both circuits have same action on specific input i.e. B|in> = A|in>. This is of particular relevance to hybrid, NISQ-era algorithms dynamical simulation or eigensolving. The user initially specifies B as blank template: layout parameterised unitary gates configured identity. compilation then proceeds using hardware perform an isomorphic energy-minimisation task, and optional gate elimination phase compress circuit. If insufficient perfect recompilation will result in approximate solution. optimise imaginary time evolution, recent extension natural gradient noisy settings. successfully recompile 7-qubit involving 186 multiple types alternative form different topology, far fewer two-qubit gates, smaller family types. Moreover we verify process robust, finding per-gate noise up 1% can still yield near-perfect recompilation. test scaling our algorithm 20 qubits, 400 parameterized incorporate custom adaptive timestep technique. note classical be useful today's prototypes, more generally may enable 'blind' harnessing device whose response control parameters deterministic but unknown.
منابع مشابه
Coherent Minimisation: Towards efficient tamper-proof compilation
Automata representing game-semantic models of programs are meant to operate in environments whose input-output behaviour is constrained by the rules of a game. This can lead to a notion of equivalence between states which is weaker than the conventional notion of bisimulation, since not all actions are available to the environment. An environment which attempts to break the rules of the game is...
متن کاملBasic circuit compilation techniques for an ion-trap quantum machine
We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an algorithm in the form of a quantum computer program, we compile it into a high-level logical circuit that goes through multiple stages of decomposition into p...
متن کاملMulti - product pricing via robust optimisation
We propose an approach to model demand uncertainty in pricing problems with capacitated resources that builds upon: (i) range forecasts for various product lines and (ii) bounds on the amount of the resources that can be used by the random part of the cumulative demand. The bounds are adjusted to reflect the decision-maker’s risk preferences. Although revenue management traditionally assumes th...
متن کاملFaster Quantum Number Factoring via Circuit Synthesis
A major obstacle to implementing Shor’s quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor’s algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces o...
متن کاملExploring Circuit Timing-aware Languages and Compilation
By adjusting the design of the ISA and enabling circuit timingsensitive optimizations in a compiler, we can more effectively exploit timing speculation. While there has been growing interest in systems that leverage circuit-level timing speculation to improve the performance and power-efficiency of processors, most of the innovation has been at the microarchitectural level. We make the observat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum
سال: 2022
ISSN: ['2521-327X']
DOI: https://doi.org/10.22331/q-2022-01-24-628